The doubly equidistant projection
نویسندگان
چکیده
منابع مشابه
Equidistant codes in the Grassmannian
Equidistant codes over vector spaces are considered. For k-dimensional subspaces over a large vector space the largest code is always a sunflower. We present several simple constructions for such codeswhichmight produce the largest non-sunflower codes. A novel construction, based on the Plücker embedding, for 1-intersecting codes of k-dimensional subspaces over Fq , n ≥ k+1 2 , where the cod...
متن کامل3D to 2D bijection for spherical objects under equidistant fisheye projection
The core problem addressed in this article is the 3D position detection of a spherical object of knownradius in a single image frame, obtained by a dioptric vision system consisting of only one fisheye lens camera that follows equidistant projection model. The central contribution is a bijection principle between a known-radius spherical object’s 3D world position and its 2D projected image cur...
متن کاملEquidistant subspace codes
In this paper we study equidistant subspace codes, i.e. subspace codes with the property that each two distinct codewords have the same distance. We provide an almost complete classification of such codes under the assumption that the cardinality of the ground field is large enough. More precisely, we prove that for most values of the parameters, an equidistant code of maximum cardinality is ei...
متن کاملEquidistant Polarizing Transforms
This paper presents a non-binary polar coding scheme that can reach the equidistant distant spectrum bound for discrete memoryless channels. This is the best that can be reached up to now and is tight for additive white Gaussian channels. To do this, we first define the equidistant property for the polarizing transforms. We have designed transforms that have better distance characteristics usin...
متن کاملOn Maximal Equidistant Permutation Arrays
An equidistant permutation array A(r, I ; u ) is a t' x r array defined on a symbol set V such that each row of the array is a permutation of the symbol set V and any two distinct rows of A have precisely A common column entries. Given r and i.. one can ask for the largest u such that an A(r, 2.; v) exists or find the smallest v such that an A(r, I; u ) exists which cannot be extended to an A(r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin géodésique
سال: 1946
ISSN: 0007-4632
DOI: 10.1007/bf02521618